Parameter%2DFree Hierarchical Co%2Dclustering by n%2DAry Splits.

Context%2DBased Distance Learning for Categorical Data Clustering.

A novel distance%2Dbased classifier built on pattern ranking.

Distance based Clustering for Categorical Data.

Towards the Automatic Construction of Conceptual Taxonomies.

Classification of chestnuts with feature selection by noise resilient classifiers.

Exploration and Reduction of the Feature Space by Hierarchical Clustering.
In this paper we propose and test the use of hierarchical clustering for feature selection. The clustering method is Ward’s with a distance measure based on Goodman-Kruskal tau. We motivate the choice of this measure and compare it with other ones. Our hierarchical clustering is applied to over 40 data-sets from UCI archive. The proposed approach is interesting from many viewpoints. First, it produces the feature subsets dendrogram which serves as a valuable tool to study relevance relationships among features. Secondarily, the dendrogram is used in a feature selection algorithm to select the best features by a wrapper method. Experiments were run with three different families of classifiers: Naive Bayes, decision trees and k nearest neighbours. Our method allows all the three classifiers to generally outperform their corresponding ones without feature selection. We compare our feature selection with other state-of-the-art methods, obtaining on average a better classification accuracy, though obtaining a lower reduction in the number of features. Moreover, differently from other approaches for feature selection, our method does not require any parameter tuning. 1
Clustering the Feature Space.
Abstract. In this paper we propose the Possibilistic C-Means in Feature
Using PageRank in Feature Selection.

Incremental Extraction of Association Rules in Applicative Domains.

An XML%2DBased Database for Knowledge Discovery.

Using a Reinforced Concept Lattice to Incrementally Mine Association Rules from Closed Itemsets.

Answering constraint%2Dbased mining queries on itemsets using previous materialized results.

Optimization of Association Rules Extraction Through Exploitation of Context Dependent Constraints.

Inductive Databases Towards a New Generation of Databases for Knowledge Discovery.

Database Support for Data Mining Applications Discovering Knowledge with Inductive Queries

A Novel Incremental Approach to Association Rules Mining in Inductive Databases.

Employing Inductive Databases in Concrete Applications.

Query Languages Supporting Descriptive Rule Mining A Comparative Study.

Query Languages Supporting Descriptive Rule Mining A Comparative Study.

Query Rewriting in Itemset Mining.

Editorial message special track on data mining.

Integrating Web Conceptual Modeling and Web Usage Mining.

Optimization of a Language for Data Mining.


Proceedings of the First International Workshop on Inductive Databases


Toward XML%2DBased Knowledge Discovery Systems.

Maximum independence and mutual information.

Theory of dependence values.
. We derive the constitutive laws that connect the velocity and the pressure gradient in stationary incompressible purely viscous non-Newtonian flows through porous media. Starting from the stationary non-Newtonian Navier-Stokes system, with viscosity obeying Carreau and power laws, and using the homogenization theory, we obtain a variety of laws according to the size of the Reynolds number. It appears that there is some critical Reynolds number such that after reaching it the flow regime in porous media changes from a linear, Darcy&#039;s type law, to a nonlinear and nonlocal law. We prove uniqueness for the homogenized problems. The proof of convergence is given under the usual assumption of periodic geometry. The main tools for getting the laws in nonlinear flow regimes are the two-scale convergence, L  r  -estimates for the pressure and monotonicity methods. The convergence for the linear flow regime is obtained using the energy method and precise estimates for the viscosity as function...
A New Approach for the Discovery of Frequent Itemsets.

Data Mining in Data Warehouses.
Izkopavanje znanja in podatkovna skladišča Tehnologije, ki se ukvarjajo s podatki so v zadnjem desetletju (devetdeseta leta) močno napredovale. Iz prve faze, kjer je šlo predvsem zato kako podatke shraniti in kako do njih učinkovito dostopati, se je razvila industrija za izdelavo orodij za delo s podatkovnimi bazami, prišlo je do standardizacije procesov, povpraševalnih jezikov itd. Ko shranjevanje podatkov ni bil več poseben problem se je pojavila potreba po bolj urejenih podatkovnih bazah, ki bi služile ne le transakcijskem procesiranju ampak tudi bolj analitskim pogledom v podatke – pojavilo se je skladiščenje podatkov (data warehousing), ki postaja vse bolj standarden del informacijskih sistemov v podjetjih. Paradigma OLAP (On-Line-Analytical-Processing) zahteva od uporabnika, da še vedno sam postavlja sistemu vprašanja in dobiva nanje odgovore in na vizualen način preverja in išče izstopajoče situacije. Ker seveda to vedno ni mogoče, se je pojavila potreba po avtomatski analizi teh podatkov oz. z drugimi besedami to, da tehnologija sama pove, kaj bi utegnilo biti zanimivo za človeka – to prinašajo
A Configurable System for the Construction of Adaptive Virtual Stores.
With the recent expansion of the Internet, the interest towards electronic sales has quickly grown and many tools have been built to help vendors to set up their Web stores. These tools offer all the facilities for building the store databases and managing the order processing and secure payment transactions, but they typically do not focus on issues like the personalization of the interaction with the customers. However, Web surfers are generally heterogeneous and have different needs and preferences; moreover, the trend of marketing strategies is to pay more and more attention to the specific buyers. So, the importance of personalizing the interaction with the user and the product presentation is increasing. In this paper, we describe the architecture of a configurable virtual Web store supporting personalized hypertextual interactions with users. Our system builds a user profile by applying user modeling techniques and stereotypical information about the characteristics of customer groups; this profile is used during the interaction in order to tailor the product descriptions and the selection of items to recommend to the user&#039;s needs, varying the layout of the hypertextual pages and the detail of the descriptions accordingly. Tailoring the system&#039;s behavior requires the parallel execution of several complex tasks during the interaction (e.g. identifying the user&#039;s preferences, selecting the products most suited to her, dynamically generating the hypertextual pages). Therefore, we have defined a multiagent architecture where these tasks
An Extension to SQL for Mining Association Rules.
Mobile devices are becoming very popular in the recent years, and large amounts of trajectory data are generated by these devices. Trajectories left behind cars, humans, birds or other objects are a new kind of data which can be very useful in decision making process in several application domains. These data, however, are normally available as sample points, and therefore have very little or no semantics. The analysis and knowledge extraction from trajectory sample points is very difficult from the user’s point of view, and there is an emerging need for new data models, manipulation techniques, and tools to extract meaningful patterns from these data. In this paper we propose a new methodology for knowledge discovery from trajectories. We propose through a semantic trajectory data mining query language several functionalities to select, preprocess, and transform trajectory sample points into semantic trajectories, at higher abstraction levels, in order to allow the user to extract meaningful, understandable, and useful patterns from trajectories. We claim that meaningful patterns can only be extracted from trajectories if the background geographic information is considered, and therefore we build the proposed methodology considering both moving object data and geographic information. The proposed language has been implemented in a toolkit in order to provide a first software prototype for trajectory knowledge discovery.
A Tightly%2DCoupled Architecture for Data Mining.

An Extension to SQL for Mining Association Rules.
Mobile devices are becoming very popular in the recent years, and large amounts of trajectory data are generated by these devices. Trajectories left behind cars, humans, birds or other objects are a new kind of data which can be very useful in decision making process in several application domains. These data, however, are normally available as sample points, and therefore have very little or no semantics. The analysis and knowledge extraction from trajectory sample points is very difficult from the user’s point of view, and there is an emerging need for new data models, manipulation techniques, and tools to extract meaningful patterns from these data. In this paper we propose a new methodology for knowledge discovery from trajectories. We propose through a semantic trajectory data mining query language several functionalities to select, preprocess, and transform trajectory sample points into semantic trajectories, at higher abstraction levels, in order to allow the user to extract meaningful, understandable, and useful patterns from trajectories. We claim that meaningful patterns can only be extracted from trajectories if the background geographic information is considered, and therefore we build the proposed methodology considering both moving object data and geographic information. The proposed language has been implemented in a toolkit in order to provide a first software prototype for trajectory knowledge discovery.


Composite Events in Chimera.

A New SQL%2Dlike Operator for Mining Association Rules.
Data mining evolved as a collection of applicative problems and efficient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant information hidden in databases of huge dimensions. In particular, one of the most investigated topics is the discovery of association rules. This work proposes a unifying model that enables a uniform description of the problem of discovering association rules. The model provides SQL-like operator, named MINE RULE,  which is capable of expressing all the problems presented so far in the literature concerning the mining of association rules. We demonstrate the expressive power of the new operator by means of several examples, some of which are classical, while some others are fully original and correspond to novel and unusual applications. We also present the operational semantics of the operator by means of an extended relational algebra.   1 Introduction  Data Mining is a novel research area that develops tech-  Pe...
